A non markovian retrial queueing system
نویسندگان
چکیده
This paper studies a discrete-time queueing system in which customer who enters the with server occupied may choose to go retrial group or begin its service displacing that was server. If is idle arriving begins immediately. Retrial and times are general, only repeated can directly one situated at first place of group. A complete study model has been curried out noting specially analysis recursive algorithm implemented by Theorems 2 3 waiting time queue system. Finally numerical examples given.
منابع مشابه
Retrial Queueing System with Several Input Flows
type i, , K , 1 i = who finds the server free begins to get service inmediately and leaves the system after completion. Otherwise, if the server is busy, the customer with probability 1 Hi leaves the system without service and with probability Hi > 0 joins an orbit of repeated customer but conserves its own type. The intervals separating two succesive repeated attempts of each customers from th...
متن کاملA Discrete-Time Retrial Queueing System With Service Upgrade
This paper considers a discrete-time retrial queueing system with displacements. The arriving customers can opt to go directly to the server obtaining immediately its service or to join the orbit. In the first case, the displaced customer goes directly to the orbit. The arrivals follow a geometrical law and the service times are general. We study the Markov chain underlying the considered queue...
متن کاملOn the BMAP_1, BMAP_2/PH/g, c retrial queueing system
In this paper, we analyze a retrial queueing system with Batch Markovian Arrival Processes and two types of customers. The rate of individual repeated attempts from the orbit is modulated according to a Markov Modulated Poisson Process. Using the theory of multi-dimensional asymptotically quasi-Toeplitz Markov chain, we obtain the stability condition and the algorithm for calculating the statio...
متن کاملTransient analysis of non-Markovian retrial queueing system with priority services, second optional service, balking, server’s interruptions and a stand by server
This paper deals with the transient analysis of batch arrival retrial queueing system with general retrial times, priority service, balking, second optional service, Bernoulli vacation, extended vacation, breakdown, delayed repair and stand by server. Here we assume that customers arrive in batches according to compound Poisson processes, where the blocked customers either with probability p jo...
متن کاملMarkovian Retrial Queues with Two Way Communication
In this paper, we first consider single server retrial queues with two way communication. Ingoing calls arrive at the server according to a Poisson process. Service times of these calls follow an exponential distribution. If the server is idle, it starts making an outgoing call in an exponentially distributed time. The duration of outgoing calls follows another exponential distribution. An ingo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2023
ISSN: ['0377-0427', '1879-1778', '0771-050X']
DOI: https://doi.org/10.1016/j.cam.2023.115277